package everyday.leetcode;

/**
 * @Author: wenjingyuan
 * @Date: 2022/09/29/18:49
 * @Description:面试题01.09字符串轮转
 * https://leetcode.cn/problems/string-rotation-lcci/
 *
 */
public class Num0109 {
    public boolean isFlipedString(String s1, String s2) {
        if(s1.length()!=s2.length()){
            return false;
        }
        if(s1.equals(s2)){
            return true;
        }
        s1=s1+s1;
        return s1.contains(s2);
    }
}
